The crystallographic fast Fourier transform. II. One-step symmetry reduction.

نویسندگان

  • Małgorzata Rowicka
  • Andrzej Kudlicki
  • Zbyszek Otwinowski
چکیده

An algorithm for evaluation of the crystallographic FFT for 67 crystallographic space groups is presented. The symmetry is reduced in such a way that it is enough to calculate P1 FFT in the asymmetric unit only and then, in a computationally simpler step, recover the final result. The algorithm yields the maximal symmetry reduction for every space group considered. For the central step in the calculation consisting of general P1 FFTs, any generic fast Fourier subroutine can be used. The approach developed in this paper is an extension of the scheme derived for p3-symmetric data [Rowicka, Kudlicki & Otwinowski (2002). Acta Cryst. A58, 574-579]. Algorithms described here will also be used in our forthcoming papers [Rowicka, Kudlicki & Otwinowski (2003). Acta Cryst A59, 183-192; Rowicka, Kudlicki & Otwinowski (2003), in preparation], where more complicated groups will be considered.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The crystallographic fast Fourier transform. Recursive symmetry reduction.

Algorithms are presented for maximally efficient computation of the crystallographic fast Fourier transform (FFT). The approach is applicable to all 230 space groups and allows reduction of both the computation time and the memory usage by a factor equal to the number of symmetry operators. The central idea is a recursive reduction of the problem to a series of transforms on grids with no speci...

متن کامل

The crystallographic fast Fourier transform. IV. FFT-asymmetric units in the reciprocal space.

New algorithms have been outlined for efficient calculation of the fast Fourier transform of data revealing crystallographic symmetries in previous papers by Rowicka, Kudlicki & Otwinowski [Acta Cryst. (2002), A58, 574-579; Acta Cryst. (2003), A59, 172-182; Acta Cryst. (2003), A59, 183-192]. The present paper deals with three implementation-related issues, which have not been discussed before. ...

متن کامل

The crystallographic fast Fourier transform. I. p3 symmetry.

An algorithm for computing the discrete Fourier transform of data with threefold symmetry axes is presented. This algorithm is straightforward and easily implemented. It reduces the computational complexity of such a Fourier transform by a factor of 3. There are no restrictive requirements imposed on the initial data. Explicit formulae and a scheme of computing the Fourier transform are given. ...

متن کامل

The crystallographic fast Fourier transform. III. Centred lattices.

Algorithms for evaluation of the crystallographic FFT for centred lattices are presented. These algorithms can be applied to 80 space groups containing centring operators. For 44 of them, combining these algorithms with those described by Rowicka, Kudlicki & Otwinowski [Acta Cryst A59, 172-182] yields the maximal symmetry reduction. For other groups, new algorithms, to be presented in our forth...

متن کامل

Pathologies cardiac discrimination using the Fast Fourir Transform (FFT) The short time Fourier transforms (STFT) and the Wigner distribution (WD)

This paper is concerned with a synthesis study of the fast Fourier transform (FFT), the short time Fourier transform (STFT and the Wigner distribution (WD) in analysing the phonocardiogram signal (PCG) or heart cardiac sounds.     The FFT (Fast Fourier Transform) can provide a basic understanding of the frequency contents of the heart sounds. The STFT is obtained by calculating the Fourier tran...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Acta crystallographica. Section A, Foundations of crystallography

دوره 59 Pt 2  شماره 

صفحات  -

تاریخ انتشار 2003